Radio Mean Labeling Of Paths And Its Total Graph

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Further results on total mean cordial labeling of graphs

A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). In thi...

متن کامل

Radio Labeling Cartesian Graph Products

Radio labeling is derived from the assignment of radio frequencies (channels) to a set of transmitters. The frequencies assigned depend on the geographical distance between the transmitters: the closer two transmitters are, the greater the potential for interference between their signals. Thus when the distance between two transmitters is small, the difference in the frequencies assigned must b...

متن کامل

Graph labeling and radio channel assignment

The vertex-labeling of graphs with nonnegative integers provides a natural setting in which to study problems of radio channel assignment. Vertices correspond to transmitter locations and their labels to radio channels. As a model for the way in which interference is avoided in real radio systems, each pair of vertices has, depending on their separation, a constraint on the difference between t...

متن کامل

further results on total mean cordial labeling of graphs

a graph g = (v,e) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : v (g) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ v (g), xy ∈ e(g), and the total number of 0, 1 and 2 are balanced. that is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). in thi...

متن کامل

Zagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs

Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Turkish Journal of Computer and Mathematics Education (TURCOMAT)

سال: 2021

ISSN: 1309-4653

DOI: 10.17762/turcomat.v12i1s.1843